On AGX Conjectures Regarding Average Eccentricity
نویسندگان
چکیده
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. In this paper we resolve five conjectures, obtained by the system AutoGraphiX, about the average eccentricity and other graph parameters (independence number, chromatic number and the Randić index), and refute two AutoGraphiX conjectures about the average eccentricity and the spectral radius.
منابع مشابه
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX (AGX), designed for finding extremal graphs with respect to given properties by the use of variable neighborhood search. The conjectures are related to the maximal ...
متن کاملOn the extremal properties of the average eccentricity
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze ext...
متن کاملVariable Neighborhood Search for Extremal Graphs, 24. Results about the clique number
A set of vertices S in a graph G is a clique if any two of its vertices are adjacent. The clique number ω is the maximum cardinality of a clique in G. A series of best possible lower and upper bounds on the difference, sum, ratio or product of ω and some other common invariants of G were obtained by the system AGX 2, and most of them proved either automatically or by hand. In the present paper,...
متن کاملAverage Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملOn Eccentricity Version of Laplacian Energy of a Graph
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...
متن کامل